Device-Independent Verifiable Blind Quantum Computation
نویسندگان
چکیده
As progress on experimental quantum processors continues to advance, the problem of verifying the correct operation of such devices is becoming a pressing concern. Although recent progress has resulted in several protocols which can verify the output of a quantum computation performed by entangled but non-communicating processors, the overhead for such schemes is prohibitive, scaling at least as the 22nd power of the number of gates. We present a new approach based on a combination of verified blind quantum computation and Bell state self-testing. This approach has significantly reduced overhead, with resources scaling as a quartic polynomial in the number of gates.
منابع مشابه
Publicly Verifiable Blind Quantum Computation
Blind quantum computation protocols allow a user with limited quantum technology to delegate an intractable computation to a quantum server while keeping the computation perfectly secret. Whereas in some protocols a user can verify that calculated outcomes are correct, a third party cannot do this, which allows a dishonest user or owner to benefit illegally. I propose a new blind quantum comput...
متن کاملOptimised resource construction for verifiable quantum computation
Recent developments have brought the possibility of achieving scalable quantum networks and quantum devices closer. From the computational point of view these emerging technologies become relevant when they are no longer classically simulatable. Hence a pressing challenge is the construction of practical methods to verify the correctness of the outcome produced by universal or non-universal qua...
متن کاملUnconditionally verifiable blind quantum computation
Joseph F. Fitzsimons1,2,* and Elham Kashefi3,4 1Singapore University of Technology and Design, 8 Somapah Road, Singapore 487372 2Centre for Quantum Technologies, National University of Singapore, 3 Science Drive 2, Singapore 117543 3School of Informatics, University of Edinburgh, 10 Crichton Street, Edinburgh EH8 9AB, United Kingdom 4LIP6, Departement Informatique et Reseaux, UPMC, 4 Place Juss...
متن کاملDelegated Pseudo-Secret Random Qubit Generator
We define the functionality of delegated pseudo-secret random qubit generator (PSRQG), where a classical client can instruct the preparation of a sequence of random qubits at some distant party. Their classical description is (computationally) unknown to any other party (including the distant party preparing them) but known to the client. We emphasize the unique feature that no quantum communic...
متن کاملGarbled Quantum Computation
The universal blind quantum computation protocol (UBQC) enables an almost classical client to delegate a quantum computation to an untrusted quantum server (in the form of a garbled quantum circuit) while the security for the client is unconditional. In this contribution, we explore the possibility of extending the verifiable UBQC, to achieve further functionalities following the analogous rese...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1502.02563 شماره
صفحات -
تاریخ انتشار 2015